Proper connection with many colors
نویسندگان
چکیده
منابع مشابه
Proper connection with many colors
In this work, we consider only edge-colorings of graphs. Since Vizing’s fundamental result [9], proper edge colorings of graphs, colorings such that no two adjacent edges have the same color, have become an essential topic for every beginning graph theorist. Proper edge colorings have many applications in signal transmission [7], bandwidth allocation [3] and many other areas [5, 6, 8]. See [1] ...
متن کاملBaryons with many colors and flavors.
Using recently-developed diagrammatic techniques, I derive some general results concerning baryons in the 1/N expansion, where N is the number of QCD colors. I show that the spin-flavor relations which hold for baryons in the large-N limit, as well as the form of the corrections to these relations at higher orders in 1/N , hold even if NF /N ∼ 1, where NF is the number of light quark flavors. I...
متن کاملProper connection of graphs
An edge-colored graph G is k-proper connected if every pair of vertices is connected by k internally pairwise vertex-disjoint proper colored paths. The k-proper connection number of a connected graph G, denoted by pck(G), is the smallest number of colors that are needed to color the edges ofG in order tomake it k-proper connected. In this paperweprove several upper bounds for pck(G). We state s...
متن کاملTotal proper connection of graphs
A graph is said to be total-colored if all the edges and the vertices of the graph is colored. A path in a total-colored graph is a total proper path if (i) any two adjacent edges on the path differ in color, (ii) any two internal adjacent vertices on the path differ in color, and (iii) any internal vertex of the path differs in color from its incident edges on the path. A total-colored graph i...
متن کاملTwo-colorings with many monochromatic cliques in both colors
Color the edges of the n-vertex complete graph in red and blue, and suppose that red k-cliques are fewer than blue k-cliques. We show that the number of red k-cliques is always less than ckn , where ck ∈ (0, 1) is the unique root of the equation z = (1 − z) + kz(1 − z)k−1. On the other hand, we construct a coloring in which there are at least ckn k −O(nk−1) red k-cliques and at least the same n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2012
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2012.v3.n4.a6